Progressive Compression of Triangle Meshes

This paper details the first publicly available implementation of progressive mesh compression algorithm described in entitled "Compressed Progressive Meshes" [R. Pajarola and J. Rossignac, IEEE Transactions on Visualization Computer Graphics, 6 (2000), pp. 79-93]. Our is generic, modular, includes several improvements stopping criteria final encoding. Given an input 2-manifold triangle mesh, iterative simplification performed, involving batches edge collapse operations guided by error metric. During this step, all information necessary for reconstruction (at decompression step) recorded compressed using key features: geometric quantization, prediction, spanning tree allowed us to carry out experimental comparison settings parameters algorithm: local metric, position type resulting vertex (after collapse), predictor.